Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Deterministic algorithms")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 944

  • Page / 38
Export

Selection :

  • and

Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA PCUTRE, Han.Journal of algorithms (Print). 2005, Vol 57, Num 2, pp 95-129, issn 0196-6774, 35 p.Article

Improved algorithms for group testing with inhibitorsDE BONIS, A; VACCARO, U.Information processing letters. 1998, Vol 67, Num 2, pp 57-64, issn 0020-0190Article

Bounding the power of preemption in randomized schedulingCANETTI, R; IRANI, S.SIAM journal on computing (Print). 1998, Vol 27, Num 4, pp 993-1015, issn 0097-5397Article

Derandomizing the HSSW Algorithm for 3-SATMAKINO, Kazuhisa; TAMAKI, Suguru; YAMAMOTO, Masaki et al.Algorithmica. 2013, Vol 67, Num 2, pp 112-124, issn 0178-4617, 13 p.Conference Paper

On-line maximizing the number of items packed in variable-sized binsEPSTEIN, Leah; FAVRHOLDT, Lene M.Lecture notes in computer science. 2002, pp 467-475, issn 0302-9743, isbn 3-540-43996-X, 9 p.Conference Paper

Randomized online multi-threaded pagingSEIDEN, S. S.Lecture notes in computer science. 1998, pp 264-275, issn 0302-9743, isbn 3-540-64682-5Conference Paper

Periodic graphs and connectivity of the rational digital hyperplanesGERARD, Yan.Theoretical computer science. 2002, Vol 283, Num 1, pp 171-182, issn 0304-3975Conference Paper

Improved derandomization of BPP using a hitting set generatorGOLDREICH, O; WIGDERSON, A.Lecture notes in computer science. 1999, pp 131-137, issn 0302-9743, isbn 3-540-66329-0Conference Paper

Efficient self-embedding of butterfly networks with random faultsTAMAKI, H.SIAM journal on computing (Print). 1998, Vol 27, Num 3, pp 614-636, issn 0097-5397Article

A survey of randomness and parallelism in comparison problemsKRIZANC, D.Lecture notes in computer science. 1998, pp 324-329, issn 0302-9743, isbn 3-540-64359-1Conference Paper

Randomized parallel prefetching and buffer managementVARMAN, P. J.Lecture notes in computer science. 1998, pp 363-372, issn 0302-9743, isbn 3-540-64359-1Conference Paper

Maximizing the area of overlap of two unions of disks under rigid motionDE BERG, Mark; CABELLO, Sergio; GIANNOPOULOS, Panos et al.Lecture notes in computer science. 2004, pp 138-149, issn 0302-9743, isbn 3-540-22339-8, 12 p.Conference Paper

Deterministic polynomial identity testing in non commutative modelsRAZ, Ran; SHPILKA, Amir.IEEE Conference on Computational Complexity. 2004, pp 215-222, isbn 0-7695-2120-7, 1Vol, 8 p.Conference Paper

Capturing an Evader in a Building : Computational geometry in navigation and path planningSUZUKI, Ichiro; ZYLINSKI, Pawel.IEEE robotics & automation magazine. 2008, Vol 15, Num 2, pp 16-26, issn 1070-9932, 11 p.Article

Finding real-valued single-source shortest paths in o(n3) expected timeKOLLIOPOULOS, S. G; STEIN, C.Journal of algorithms (Print). 1998, Vol 28, Num 1, pp 125-141, issn 0196-6774Article

Improved lower bound for deterministic broadcasting in radio networksFISCH BRITO, Carlos; VAYA, Shailesh.Theoretical computer science. 2011, Vol 412, Num 29, pp 3568-3578, issn 0304-3975, 11 p.Article

A primal-dual algorithm for online non-uniform facility locationFOTAKIS, Dimitris.Lecture notes in computer science. 2005, pp 47-56, issn 0302-9743, isbn 3-540-29673-5, 1Vol, 10 p.Conference Paper

Optimal power-down strategiesAUGUSTINE, John; IRANI, Sandy; SWAMY, Chaitanya et al.Annual Symposium on Foundations of Computer Science. 2004, pp 530-539, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

The relative worst order ratio applied to seat reservationBOYAR, Joan; MEDVEDEV, Paul.Lecture notes in computer science. 2004, pp 90-101, issn 0302-9743, isbn 3-540-22339-8, 12 p.Conference Paper

A hybrid evolution strategy for mixed discrete continuous constrained problemsMOREAU-GIRAUD, L; LAFON, P.Lecture notes in computer science. 2000, pp 123-135, issn 0302-9743, isbn 3-540-67846-8Conference Paper

Assigning tasks to resource pools : A fuzzy set approachDE KORVIN, A; HASHEMI, S; QUIRCHMAYR, G et al.Lecture notes in computer science. 2000, pp 102-114, issn 0302-9743, isbn 3-540-67978-2Conference Paper

Graph isomorphism : Its complexity and algorithmsTODA, S.Lecture notes in computer science. 1999, issn 0302-9743, isbn 3-540-66836-5, p. 341Conference Paper

Cascade error projection : A learning algorithm for hardware implementationDUONG, T. A; DAUD, T.Lecture notes in computer science. 1999, pp 450-457, issn 0302-9743, isbn 3-540-66069-0Conference Paper

Motif statistics : AbstractNICODEME, P; SALVY, B; FLAJOLET, P et al.Lecture notes in computer science. 1999, pp 194-211, issn 0302-9743, isbn 3-540-66251-0Conference Paper

A variant of the arrow distributed directory with low average complexityPELEG, D; RESHEF, E.Lecture notes in computer science. 1999, pp 615-624, issn 0302-9743, isbn 3-540-66224-3Conference Paper

  • Page / 38